-
1 polyadic form
-
2 polyadic form
Большой англо-русский и русско-английский словарь > polyadic form
-
3 polyadic form
Вычислительная техника: полиадическая форма (записи чисел) -
4 polyadic form
English-Russian dictionary of computer science and programming > polyadic form
-
5 polyadic form
-
6 polyadic
1) компьют. многоместный
2) многочленный
3) полиадический ∙ - polyadic algebra - polyadic analysis - polyadic automaton - polyadic calculus - polyadic form - polyadic operation - polyadic relation - polyadic setБольшой англо-русский и русско-английский словарь > polyadic
-
7 form
1) форма || формировать, образовывать2) (экранный) бланк, формуляр4) матем. выражение•- form the instruction- accounting form
- analog form
- analytic form
- archive form
- Backus normal form
- Backus-Naur form
- binary quadratic form
- canonical form
- coding form
- common machine-readable form
- conjuctive normal form
- cut form
- data collection form
- description form
- digital form
- disjunctive normal form
- E form
- elemental form
- entry form
- excess form
- exponent form
- exponent-plus N form
- fanfold forms
- full conjunctive normal form
- full disjunctive normal form
- graphical form
- graphic form
- implicative normal form
- internal form
- irredundant form
- linear form
- machine-processible form
- minterm form
- name form
- nested form
- normal form
- normalized form
- plain-text form
- polyadic form
- prenex form
- quadratic form
- sentencial form
- standard form
- state-space form
- true form
- two-level formEnglish-Russian dictionary of computer science and programming > form
-
8 полиадическая форма
Большой англо-русский и русско-английский словарь > полиадическая форма
-
9 relation
1) зависимость, (взаимо)связь2) отношение; соотношение4) геол. условия залегания•- almost universal relation - cause-effect relation - generalized semigroup relation - logically irreducible relation - parametrically definable relation - partial ordering relation - recursively enumerable relation - recursively invariant relation - recursively representable relation - strongly definable relation - weakly symmetric relation
См. также в других словарях:
Pi-calculus — In theoretical computer science, the pi calculus is a process calculus originally developed by Robin Milner, Joachim Parrow and David Walker as a continuation of work on the process calculus CCS (Calculus of Communicating Systems). The aim of the … Wikipedia
π-calculus — In theoretical computer science, the π calculus (or pi calculus) is a process calculus originally developed by Robin Milner, Joachim Parrow and David Walker as a continuation of work on the process calculus CCS (Calculus of Communicating Systems) … Wikipedia
Quasigroup — In mathematics, especially in abstract algebra, a quasigroup is an algebraic structure resembling a group in the sense that division is always possible. Quasigroups differ from groups mainly in that they need not be associative. A quasigroup with … Wikipedia
Monadic predicate calculus — In logic, the monadic predicate calculus is the fragment of predicate calculus in which all predicate letters are monadic (that is, they take only one argument), and there are no function letters. All atomic formulae have the form P(x), where P… … Wikipedia
Arity — In logic, mathematics, and computer science, the arity i/ˈær … Wikipedia
Natural deduction — In logic and proof theory, natural deduction is a kind of proof calculus in which logical reasoning is expressed by inference rules closely related to the natural way of reasoning. This contrasts with the axiomatic systems which instead use… … Wikipedia
Monadic Boolean algebra — In abstract algebra, a monadic Boolean algebra is an algebraic structure with signature 〈A, ·, +, , 0, 1, ∃〉 of type 〈2,2,1,0,0,1〉, where 〈A, ·, +, , 0, 1〉 is a Boolean algebra. The prefixed unary operator ∃ denotes the existential quantifier,… … Wikipedia
List of algebraic structures — In universal algebra, a branch of pure mathematics, an algebraic structure is a variety or quasivariety. Abstract algebra is primarily the study of algebraic structures and their properties. Some axiomatic formal systems that are neither… … Wikipedia
n-ary group — In mathematics, an n ary group (also n group, polyadic group or multiary group) is a generalization of a group to a set G with a n ary operation instead of a binary operation.[1] The axioms for an n ary group are defined in such a way as to… … Wikipedia
Outline of algebraic structures — In universal algebra, a branch of pure mathematics, an algebraic structure is a variety or quasivariety. Abstract algebra is primarily the study of algebraic structures and their properties. Some axiomatic formal systems that are neither… … Wikipedia
CP decomposition — In multilinear algebra, the canonical polyadic decomposition (CPD), historically known as PARAFAC and later CANDECOMP, is a generalization of the matrix singular value decomposition (SVD) to tensors, with many applications in in statistics,… … Wikipedia
